<?php
/**
 * @title 106. 从中序与后序遍历序列构造二叉树
 * @author start2004
 */

// ini_set("memory_limit", "128M");

// class Solution {
//
//     function find() {
//
//     }
// }

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     public $val = null;
 *     public $left = null;
 *     public $right = null;
 *     function __construct($val = 0, $left = null, $right = null) {
 *         $this->val = $val;
 *         $this->left = $left;
 *         $this->right = $right;
 *     }
 * }
 */
class Solution {

    /**
     * @param Integer[] $inorder
     * @param Integer[] $postorder
     * @return TreeNode
     */
    function buildTree($inorder, $postorder) {
        /**
         * @since 2023-12-27 节点数量
         */
        $count = count($inorder);
        if($count == 0){
            return null;
        } else {}

        /**
         * @since 2023-12-27 中序，left-root-right
         * @since 2023-12-27 后序，left-right-root
         * @since 2023-12-27 后序最后一个节点是根节点root
         */
        $root = new TreeNode($postorder[$count-1]);

        /**
         * @since 2023-12-27 root在中序的位置
         */
        $rootIndex = array_search($root->val, $inorder);


        /**
         * @since 2023-12-27 左子树的中序和后序
         */
        $leftInorder = array_slice($inorder, 0, $rootIndex);
        $leftPostorder = array_slice($postorder, 0, $rootIndex);

        /**
         * @since 2023-12-27 右子树的中序和后序
         */
        $rightInorder = array_slice($inorder, $rootIndex+1);
        $rightPostorder = array_slice($postorder, $rootIndex, $count-$rootIndex-1);

        /**
         * @since 2023-12-27 root的左右子树
         */
        $root->left = $this->buildTree($leftInorder, $leftPostorder);
        $root->right = $this->buildTree($rightInorder, $rightPostorder);
        
        /**
         * @return TreeNode
         */
        return $root;
    }
}


/**
 * @url http://127.0.0.1/leetcode/202312/2023.12.27_5.php
 */
$datas = [

];

include_once dirname(__DIR__) . DIRECTORY_SEPARATOR ."xhprof.php";
$xhprof = new Xhprof();
foreach ($datas as $data){
    if(count($data) <= 20){
        var_dump($data);
    } else {
        var_dump(count($data));
    }

    $obj = new Solution();
    $result = $obj->(...$data);
    // $result = $obj->($xhprof->tree($data));
    // $result = $obj->($xhprof->listNode($data));
    // $result = $obj->find(...$data);
    var_dump($result);
    // if(count($result)<=20){
    //     var_dump($result);
    // } else {
    //     var_dump(count($result));
    // }
    echo str_repeat(PHP_EOL, 3);
    echo str_repeat("<br>", 3);
}

// foreach ($datas as $data){
//     $obj = new $data[0][0](...$data[1][0]);
//
//     for ($i=1; $i<count($data[0]); $i++){
//         $func = $data[0][$i];
//         $param = $data[1][$i];
//         $result = $obj->$func(...$param);
//
//         echo $data[0][$i] ."(\"". implode(",", $data[1][$i]) ."\") ";
//             if($result === true){
//                 echo "True";
//             } elseif($result === false) {
//                 echo "False";
//             } elseif($result === null) {
//                 echo "Null";
//             } elseif(is_array($result)) {
//                 var_dump($result);
//             } else {
//                 echo $result;
//             }
//         echo PHP_EOL;
//     }
//
//     echo str_repeat(PHP_EOL, 3);
// }
$xhprof->end();
